P3ON: Proximity-based Peer-to-Peer Overlay Networks

نویسندگان

  • Kunwoo Park
  • Sangheon Pack
  • Yanghee Choi
  • Taekyoung Kwon
چکیده

Peer-to-peer(P2P) overlay networks provide robust, scalable file sharing services. The hop distance between two virtual nodes in P2P overlay networks is irrelevant to the real distance between two nodes. Therefore, many lookup operations may be executed, without considering the real distance, even though a node wants to find a file object located in another node within the same subnet. To overcome this drawback, we propose a proximity-based peer-to-peer overlay networks (P3ON). In P3ON, the proximity between two nodes is exploited to achieve a fast lookup operation. In other words, two nodes within the same subnet are mapped to the adjacent overlay nodes, so that the lookup time between them can be reduced significantly. In addition, two phase lookup algorithm and caching scheme are suggested to maximize the locality in P3ON. In our future work, we will extend P3ON to support large-scale P2P services as well as hierarchical mobile P2P services.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Exploiting network proximity in peer-to-peer overlay networks

Generic peer-to-peer (p2p) overlay networks like CAN, Chord, Pastry and Tapestry offer a novel platform for a variety of scalable and decentralized distributed applications. These systems provide efficient and fault-tolerant routing, object location and load balancing within a self-organizing overlay network. One important aspect of these systems is how they exploit network proximity in the und...

متن کامل

Using Proximity Measure to Improve Locality in Structured P2P Networks

Peer-to-peer networks are generally characterized in terms of sharing computer resources without the intermediation of a centralized server. Interconnected nodes in peer-to-peer networks are able to communicate through a self organizing topology which runs as an overlay on top of the physical network. The mismatch problem between underlay and overlay network in such systems, known as locality p...

متن کامل

Routing Path Queries in Peer-to-Peer Systems

Peer-to-peer systems are gaining popularity as a means to effectively share huge, massively distributed data collections. An important challenge in this context is discovering the appropriate data and services. In this paper, we consider peers that store XML documents. We show how an extension of traditional Bloom filters, called multi-level Bloom filters, can be used to route path queries in s...

متن کامل

Proximity neighbor selection in tree-based structured peer-to-peer overlays

Structured peer-to-peer (p2p) overlay networks provide a useful substrate for building distributed applications. They assign object keys to overlay nodes and provide a primitive to route a message to the node responsible for a key. Proximity neighbor selection (PNS) can be used to achieve both low delay routes and low bandwidth usage but it introduces high overhead. This paper presents a detail...

متن کامل

A Proximity-Based Self-Organizing Hierarchical Overlay Framework for Distributed Hash Tables

Several structured peer-to-peer networks have been created to solve the scalability problem of previous peer-to-peer systems such as Gnutella and Napster. These peer-to-peer networks which support distributed hash table functionality construct a sort of structured overlay network, which can cause a topology mismatch between the overlay and the underlying physical network. To solve this mismatch...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2005